Learnability of Simply-Moded Logic Programs from Entailment

Polynomial-time learnability of logic programs with local variables from entailment

Logic Programs as term Rewriting Systems

This paper studies the relationship between logic programs and term rewrit ing systems TRSs A compositional transform is de ned which given a logic program computes a TRS For a relevant class of logic programs called Simply Well Moded SWM there is a one to one correspondence between computed answer substitutions of the logic program and normal forms of the correspond ing TRS Moreover the transf...

Translating Logic Programs into Conditional Rewriting Systems

In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is deened. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. programming: transforming logic programs to lazy fu...

Non-transformational Termination Analysis of Logic Programs, Based on General Term-ordering Non-transformational Termination Analysis of Logic Programs, Based on General Term-ordering

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in trans-formational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. W...

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling

In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed selection rule such as the left-to-right one of Prolog. This has applications e.g. in parallel programming. A mechanism to control dynamic scheduling is provided in existing languages in the form of delay declaration...